A tool for integer homology computation: λ-AT-model
نویسندگان
چکیده
منابع مشابه
A Tool for Integer Homology Computation: λ-AT-Model ?
In this paper, we formalize the notion of λ-AT-model (where λ is a non-null integer) for a given chain complex, which allows the computation of homological information in the integer domain avoiding using the Smith Normal Form of the boundary matrices. We present an algorithm for computing such a model, obtaining Betti numbers, the prime numbers p involved in the invariant factors of the torsio...
متن کاملA tool for integer homology computation: lambda-AT-model
In this paper, we formalize the notion of λ-AT-model (where λ is a non-null integer) for a given chain complex, which allows the computation of ho-mological information in the integer domain avoiding using the Smith Normal Form of the boundary matrices. We present an algorithm for computing such a model, obtaining Betti numbers, the prime numbers p involved in the invariant factors of the torsi...
متن کاملExtending the Notion of AT-Model for Integer Homology Computation
When the ground ring is a field, the notion of algebraic topological model (AT-model) is a useful tool for computing (co)homology, representative (co)cycles of (co)homology generators and the cup product on cohomology of nD digital images as well as for controlling topological information when the image suffers local changes [6, 7, 9]. In this paper, we formalize the notion of λ-AT-model (λ bei...
متن کاملDeveloping a Mixed Integer Quadratic Programing Model with Integer Numbers for Designing a Dynamic closed-loop Logistics Network
Logistics Network Design includes network configuration decisions having long-standing influences on other tactical and operational decisions. Recently, regarding environmental issues and customer awareness and global warming closed-loop supply chain network design is taken into consideration. The proposed network for the integrated forward and reverse logistics is developed by formulating a cy...
متن کاملInterleaved computation for persistent homology
We describe an approach to bounded-memory computation of persistent homology and betti barcodes, in which a computational state is maintained with updates introducing new edges to the underlying neighbourhood graph and percolating the resulting changes into the simplex stream feeding the persistence algorithm. We further discuss the memory consumption and resulting speed and complexity behaviou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Image and Vision Computing
سال: 2009
ISSN: 0262-8856
DOI: 10.1016/j.imavis.2008.10.001